Response surface methodology's steepest ascent and step size revisited

نویسندگان

  • Jack P. C. Kleijnen
  • Dick den Hertog
  • Ebru Angün
چکیده

Response Surface Methodology (RSM) searches for the input combination maximizing the output of a real system or its simulation. RSM is a heuristic that locally fits first-order polynomials, and estimates the corresponding steepest ascent (SA) paths. However, SA is scale-dependent; and its step size is selected intuitively. To tackle these two problems, this paper derives novel techniques combining mathematical statistics and mathematical programming. Technique 1 called 'adapted' SA (ASA) accounts for the covariances between the components of the estimated local gradient. ASA is scale-independent. The step-size problem is solved tentatively. Technique 2 does follow the SA direction, but with a step size inspired by ASA. Mathematical properties of the two techniques are derived and interpreted; numerical examples illustrate these properties. The search directions of the two techniques are explored in Monte Carlo experiments. These experiments show that-in general-ASA gives a better search direction than SA.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Response Surface Methodology for Optimizing Hyper Parameters

The performance of an algorithm often largely depends on some hyper parameter which should be optimized before its usage. Since most conventional optimization methods suffer from some drawbacks, we developed an alternative way to find the best hyper parameter values. Contrary to the well known procedures, the new optimization algorithm is based on statistical methods since it uses a combination...

متن کامل

Quad Search and Hybrid Genetic Algorithms

A bit climber using a Gray encoding is guaranteed to converge to a global optimum in fewer than evaluations on unimodal 1-D functions and on multi-dimensional sphere functions, where bits are used to encode the function domain. Exploiting these ideas, we have constructed an algorithm we call Quad Search. Quad Search converges to a local optimum on unimodal 1-D functions in not more than functio...

متن کامل

Surface Networks: Extension Of The Topology And Extraction From Bilinear Surface Patches

Surface networks capture the topological relations between passes of a continuous surface, the paths of steepest descent and ascent starting at the passes, and the pits and peaks where the steepest paths end. This paper extends the topology of the network in three ways. Objects at the edge of the surface model are introduced. Horizontal areas may represent passes, pits, or peaks, and therefore ...

متن کامل

Constant time Steepest Ascent Local Search with Statistical Lookahead for NK-Landscapes

A modified form of steepest ascent local search is proposed that displays an average complexity of O(1) time per move for NKLandscape problems. The algorithm uses a Walsh decomposition to identify improving moves. In addition, it is possible to compute a Hamming distance 2 statistical lookahead: if x is the current solution and y is a neighbor of x, it is possible to compute the average evaluat...

متن کامل

Optimization of Milk-Based Medium for Efficient Cultivation of Bifidobacterium pseudocatenulatum G4 Using Face-Centered Central Composite-Response Surface Methodology

This study was undertaken to optimize skim milk and yeast extract concentration as a cultivation medium for optimal Bifidobacteria pseudocatenulatum G4 (G4) biomass and β -galactosidase production as well as lactose and free amino nitrogen (FAN) balance after cultivation period. Optimization process in this study involved four steps: screening for significant factors using 2(3) full factorial d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • European Journal of Operational Research

دوره 170  شماره 

صفحات  -

تاریخ انتشار 2004